On the Power of Stratified Logic Programs with Value Invention for Expressing Database Transformations
نویسنده
چکیده
The expressive power of the family of ILOG (:) languages is investigated. The languages are rule based, with value invention and stratiied negation. The chosen semantics for value invention is based on Skolem functor terms. We show that, in presence of value invention , the whole expressive power is achieved using programs made of two strata, and that ILOG 6 = (i.e., the class of programs with non-equality and without negation) express the downward monotone list constructive transformations.
منابع مشابه
Universit a Degli Studi the Expressive Power of Stratiied Logic Programs with Value Invention Programs with Value Invention for Expressing Database Transformations" in International
The expressive power of the family wILOG(:) of relational query languages is investigated. The languages are rule based, with value invention and strati ed negation. The semantics for value invention is based on Skolem functor terms. We study a hierarchy of languages based on the number of strata allowed in programs. We rst show that, in presence of value invention, the class of strati ed progr...
متن کاملThe Expressive Power of Stratified Logic Programs with Value Invention
The expressive power of the family wILOG of relational query languages is investi gated The languages are rule based with value invention and strati ed negation The semantics for value invention is based on Skolem functor terms We study a hierarchy of languages based on the number of strata allowed in programs We rst show that in presence of value invention the class of strati ed programs made ...
متن کاملExpressiveness of Semipositive Logic Programs with Value Invention
We study the expressive power of the relational query language wILOG 1 2 ;: of semipositive datalog programs extended with a mechanism of safe value invention. We adopt a semantics for value invention based on the use of Skolem functor terms. We show that this language expresses exactly the class of semimonotone queries, that is, the class of computable queries that are preserved under extensions.
متن کاملThe Defining Power of Stratified and Hierarchical Logic Programs
We investigate the defining power of stratified and hierarchical logic programs. As an example for the treatment of negative information in the context of these structured programs we also introduce a stratified and hierarchical closed-world assumption. Our analysis tries to relate the defining power of stratified and hierarchical programs (with and without an appropriate closed-world assumptio...
متن کاملA Logic Foundation for Program Transformations
This paper presents a uniform foundation for representing, analysing and transforming programs and models. It is firmly grounded on logic and defines a seamless integration of declarative analyses and of transformations based on these analyses. As such it is an entirely novel approach that recommends itself as an alternative to known transformation formalisms and possibly a unifying framework f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995